Ontology Merging Using Belief Revision and Defeasible Logic Programming
نویسندگان
چکیده
We combine argumentation, belief revision and description logic ontologies for extending the δ-ontologies framework to show how to merge two ontologies in which the union of the strict terminologies could lead to inconsistency. To solve this problem, we revisit a procedure presented by Falappa et al. in which part of the offending terminologies are turned defeasible by using a kernel revision operator.
منابع مشابه
Merging of Ontologies Using Belief Revision and Defeasible Logic Programming
Ontology merging refers to the process of creating a new ontology from two or more existing ontologies with overlapping parts. The δ-ontologies framework allows to reason with possibly inconsistent Description Logic ontologies by interpreting them in Defeasible Logic Programming, which is an approach to common-sense reasoning based on defeasible argumentation and logic programming. In tradition...
متن کاملA Preliminary Reification of Argument Theory Change
In this article we introduce the basics for understanding the mechanisms of Argument Theory Change. In particular we reify it using Defeasible Logic Programming. In this formalism, knowledge bases are represented through defeasible logic programs. The main change operation we define over a defeasible logic program is a special kind of revision that inserts a new argument and then modifies the r...
متن کاملA Stratification-based Approach for Inconsistency Handling in Description Logics
Inconsistency handling is a central problem in many knowledge representation fields, such as belief revision, belief merging. Many approaches have been proposed to handle inconsistency in ontologies. In this paper, we propose a stratification-based approach for inconsistency handling in description logics (DLs), a family of ontology languages. This approach consists of two steps. In the first s...
متن کاملDynamics of knowledge in DeLP through Argument Theory Change
1 This article is devoted to the study of methods to change defeasible logic programs (de.l.p.s) which are the knowledge bases used by the Defeasible Logic Programming (DeLP) interpreter. DeLP is an argumentation formalism that allows to reason over potentially inconsistent de.l.p.s. Argument Theory Change (ATC) studies certain aspects of belief revision in order to make them suitable for abstr...
متن کاملChanging Legal Systems: Abrogation and Annulment. Part II: Temporalised Defeasible Logic
In this paper we propose a temporal extension of Defeasible Logic to model legal modifications, such as abrogation and annulment. Hence, this framework overcomes the difficulty, discussed elsewhere [7], of capturing these modification types using belief and base revision.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012